An Improved Meerkat Clan Algorithm for Solving 0-1 Knapsack Problem

نویسندگان

چکیده

Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of meerkat animal. This paper presents an improvement on MCA based chaotic map and crossover strategy (MCA-CC). These two strategies increase diversification intensification proposed boost searching ability to find more quality solutions. The 0-1 knapsack problem was solved by basic improved version this performance these algorithms tested low high dimensional problems. experimental results demonstrate that had overcome in terms solution quality, speed gained optimality with Furthermore, problems, it has competitive comparison other algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem

This paper presents an improved hybrid Genetic Algorithm (GA) for solving the Multiconstrained 0–1 Knapsack Problem (MKP). Based on the solution of the LP-relaxed MKP, an efficient pre-optimization of the initial population is suggested. Furthermore, the GA uses sophisticated repair and local improvement operators which are applied to each newly generated solution. Care has been taken to define...

متن کامل

An Improved Multi-objective Evolutionary Algorithm for Multi- Objective 0/1 Knapsack Problem

To further enhance the distribution uniformity and extensiveness of the solution sets and to ensure effective convergence of the solution sets to the Pareto front, we proposed a MOEA approach based on a clustering mechanism. We named this approach improved multi-objective evolutionary algorithm (LMOEA). This algorithm uses a clustering technology to compute and maintain the distribution and div...

متن کامل

Alienor Method for Solving the 0-1 Quadratic Knapsack Problem

The quadratic knapsack problem (QKP) is the problem of maximizing a quadratic objective function subject to a single knapsack constraint. It is a well-known NP-hard combinatorial problem. In this paper, we examine the use of Alienor method for solving QKP. Alienor method is a new global optimization algorithm based on a simple idea consisting in approximating an n variables function by a single...

متن کامل

A Partitioning Scheme for Solving the 0-1 Knapsack Problem

The application of valid inequalities to provide relaxations which can produce tight bounds, is now common practice in Combinatorial Optimisation. This paper attempts to complement current theoretical investigations in this regard. We experimentally search for "valid" equalities which have the potential of strengthening the problem's formulation. Recently, Martello and Toth [13] included cardin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Iraqi journal of science

سال: 2022

ISSN: ['0067-2904', '2312-1637']

DOI: https://doi.org/10.24996/ijs.2022.63.2.32